package com.链表.练习题;

public class Leetcode206 {
    /**
     * 反转链表
     * 给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。
     *
     *输入：head = [1,2,3,4,5]
     * 输出：[5,4,3,2,1]
     */
    public class ListNode {
      int val;
      ListNode next;
      ListNode() {}
      ListNode(int val) { this.val = val; }
      ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  }
    public ListNode reverseList(ListNode head) {
        ListNode n1 = null;
        ListNode p = head;
        while (p != null){
            n1 = new ListNode(p.val,n1);
            p = p.next;
        }
        return n1;
    }
}
